Bounds for the Lonely Runner Problems Via Linear Programming
نویسندگان
چکیده
Abstract In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
منابع مشابه
A goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملFlows, View Obstructions, and the Lonely Runner
We prove the following result. Let G be an undirected graph. If G has a nowhere zero ow with at most k di erent values, then it also has one with values from the set f1; : : : ; kg. When k 5, this is a trivial consequence of Seymour's \sixow theorem". When k 4 our proof is based on a lovely number theoretic problem which we call the \Lonely Runner Conjecture". Suppose k runners having nonzero c...
متن کاملThe Lonely Runner with Seven Runners
Suppose k + 1 runners having nonzero constant speeds run laps on a unit-length circular track starting at the same time and place. A runner is said to be lonely if she is at distance at least 1/(k + 1) along the track to every other runner. The lonely runner conjecture states that every runner gets lonely. The conjecture has been proved up to six runners (k ≤ 5). A formulation of the problem is...
متن کاملTight Instances of the Lonely Runner
The Lonely Runner Conjecture of J. Wills asserts the following. For any vector v ∈ (R−{0})n−1 there exists t ∈ R such that every component of tv has distance at least 1/n to the nearest integer. We study those vectors v for which the bound of this conjecture is attained. In particular, we construct an infinite family of such tight vectors. This family, plus three sporadic examples, constitute a...
متن کاملSecretary Problems via Linear Programming
In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. This basic concept of n elements arriving in a random order and irrevocable decisions made by an algorithm have been explored extensively over the years, and used for modeling the behavior of many processes. Our main contribution is a new linear prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin Of The Brazilian Mathematical Society, New Series
سال: 2021
ISSN: ['1678-7544', '1678-7714']
DOI: https://doi.org/10.1007/s00574-021-00272-7